Packet Fair Queuing Algorithms for Wireless Networks
نویسندگان
چکیده
Due to the rapid growth of wireless data services, the issues of providing different quality of services and fair channel access have become more and more crucial. In wireline networks, there are many mature fair queuing algorithms that can provide fairness and bounded delay properties. However, they cannot be directly applied to wireless networks because of the bursty and location-dependent error characteristics of wireless channels. So many fair queuing algorithms designed for wireless networks are proposed. In this chapter, we introduce the concept of fair queuing in wireline networks, discuss the problems and difficulties to apply them to wireless networks, and provide a comprehensive survey of recent research on wireless fair queuing algorithms.
منابع مشابه
Soft QoS provisioning using the token bank fair queuing scheduling algorithm
Future-generation wireless packet networks will support multimedia applications with diverse QoS requirements. Much of the research on scheduling algorithms has been focused on hard QoS provisioning of integrated services. Although these algorithms give hard delay bounds, their stringent requirements sacrifice the potential statistical multiplexing performance and flexibility of the packet-swit...
متن کاملSoft-qos Provisioning Using the Token Bank Fair Queueing Scheduling Algorithm
Future generation wireless packet networks will support multimedia applications with diverse quality-of-service (QoS) requirements. Much of the research on scheduling algorithms has been focused on hard QoS provisioning of integrated services. Although these algorithms give hard delay bounds, their stringent requirements sacrifice the potential statistical multiplexing performance and flexibili...
متن کاملPacket Fair Queueing Algorithms for Wireless Networks with Location-Dependent Errors
While Packet Fair Queueing (PFQ) algorithms provide both bounded delay and fairness in wired networks, they cannot be applied directly to wireless networks. The key difficulty is that in wireless networks sessions can experience location-dependent channel errors. This may lead to situations in which a session receives significantly less service than it is supposed to, while another receives mor...
متن کاملA fair scheduling algorithm with traffic classification for wireless networks
Wireless channels are characterized by more serious bursty and location-dependent errors. Many packet scheduling algorithms have been proposed for wireless networks to guarantee fairness and delay bounds. However, most existing schemes do not consider the difference of traffic natures among packet flows. This will cause the delay-weight coupling problem. In particular, serious queuing delays ma...
متن کاملDesign and Evaluation of a Weighted Sacrificing Fair Queueing Algorithm for Wireless Packet Networks
Fair scheduling algorithms have been proposed to tackle the problem of bursty and location-dependent errors in wireless packet networks. Most of those algorithms ensure the fairness property and guarantee the QoS of all sessions in a large-scale cellular network such as GSM or GPRS. In this paper, we propose the Weighted-Sacrificing Fair Queueing (WSFQ) scheduling algorithm for small-area and d...
متن کامل